Parameterized algorithmics for linear arrangement problems
نویسندگان
چکیده
منابع مشابه
Parameterized algorithmics for linear arrangement problems
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for these problems. However, the analysis of these algorithms is sometimes not so easy.
متن کاملParameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
In graph modification problems, one is given a graph G and the goal is to apply a minimum number of modification operations (such as edge deletions) to G such that the resulting graph fulfills a certain property. For example, the Cluster Deletion problem asks to delete as few edges as possible such that the resulting graph is a disjoint union of cliques. Graph modification problems appear in nu...
متن کاملParameterized Algorithmics for Network Analysis: Clustering & Querying
Preface This thesis summarizes some of my results on NP-hard graph problems that have applications in the areas of network clustering and querying. The research for obtaining these results was Forschungsgemeinschaft (DFG), as a researcher in the DFG project " Parameterized Algorithmics for Bioinformatics " (PABI, NI 369/7). I want to express my gratitude to Rolf Niedermeier for giving me the op...
متن کاملParameterized Algorithmics for Network Analysis: Clustering & Querying
Preface This thesis summarizes some of my results on NP-hard graph problems that have applications in the areas of network clustering and querying. The research for obtaining these results was Forschungsgemeinschaft (DFG), as a researcher in the DFG project " Parameterized Algorithmics for Bioinformatics " (PABI, NI 369/7). I want to express my gratitude to Rolf Niedermeier for giving me the op...
متن کاملNONBLOCKER: Parameterized Algorithmics for minimum dominating set
We provide parameterized algorithms for nonblocker, the parametric dual of the well known dominating set problem. We exemplify three methodologies for deriving parameterized algorithms that can be used in other circumstances as well, including the (i) use of extremal combinatorics (known results from graph theory) in order to obtain very small kernels, (ii) use of known exact algorithms for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.05.008